Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

协同制造系统的可靠性分析

协同制造作为一种先进制造模式,逐渐成为研究的热点。而系统的可靠性是协同制造系统成功实施的关键因素之一。从协同制造系统的自身特点出发,阐述了进行协同制造系统可靠性研究的必要性和紧迫性。并给出了协同制造系统可靠性分析的框架模型,认为协同制造系统可靠性应该从人、工作流系统和设备硬件等几个方面进行综合研究,并对各部分的可靠性研究进行了概述。     

(Re-)emergent orders: understanding the negotiation(s) of rebel governance

Abstract

The concept of order is often neglected in the study of conflict – seemingly such a ‘disordering’ process. With the recent increase in the examination of rebel governance however, bringing order back into our understanding of rebel and insurgent groups has much to offer in exploring the everyday politics which connect authorities, rebel movements and the population itself, in a complex mass of intersubjective and power-based interactions and negotiations. Rebels both shape and are shaped by existing forms of order in complex and ongoing ways. This article explores how varying elements interact in the negotiation, framing and enforcement of order and develops an original analytical framework to examine the perpetual negotiations of rebel movements in their attempts to cement their control.     

舰艇编队协同作战的空中目标威胁评估研究

从系统分析舰艇编队协同作战的空中目标威胁评估问题入手,深入研究了协同作战环境下编队空中目标威胁评估的基本过程。在此基础上,针对编队协同决策的特点,建立了基于两层决策的协同作战环境下编队空中目标威胁评估模型,从而提出了舰艇编队协同作战的空中目标威胁评估方法。最后,通过实例说明了所提方法的有效性。     

基于学科间差异信息的协同优化改进算法

分析了MDO(Multidisciplinary Design Optimization)中广泛应用的协同优化算法的特点和存在的问题,提出了一种基于学科间差异信息的协同优化改进算法COMI(Collaborative Optimization based on Multidisciplinary Inconsistency).利用学科间差异信息构造了系统级松弛约束和系统级罚函数,利用遗传算法作为系统级优化算法,并采用标准算例比较了标准CO(Collaborative Optimization)算法、松弛CO算法与COMI算法的性能.结果表明COMI算法在设计结果可行性和最优值上平衡性较好.     

基于协商的Agent资源冲突消解算法研究

针对分布式规划系统中Agent计划的资源冲突问题,研究了资源冲突的分类;基于Agent协商理论,从资源最优配置的角度,论证了最优的协商策略,提出了可重复利用的不可分享型资源的冲突消解算法,较好地解决了Agent分布式规划中出现的一类资源冲突问题。算例表明,给出的冲突消解算法是有效的。     

Optimization and mediated bartering models for ground delay programs

The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

协同虚拟样机环境体系结构研究

协同虚拟样机 (CollaborativeVirtualPrototyping)是一种以一体化多学科设计和分析模型为核心的 ,由各种应用、底层支撑技术和标准组成的支持虚拟样机协同设计、建模和仿真的集成技术。首先介绍了协同虚拟样机的基本概念 ,接着对协同虚拟样机环境的概念和技术框架进行了分析。在对典型的虚拟样机环境体系结构进行分析的基础上 ,提出了支持武器装备虚拟采办的协同虚拟样机体系结构     

对数据后处理雷达的多参数协同相关干扰

基于DRFM转发或者重复转发的干扰信号,虽然在功率上能达到干扰要求,但是产生的虚假目标与真实目标缺乏相关性,数据后处理雷达能根据该特性实现对欺骗干扰信号的检测和抑制。针对数据后处理雷达在抑制非相关干扰信号的优越表现,根据不同特征域干扰信号的相关性要求,提出了在幅度域上具有起伏特性,时频域协同一致,方位上具有相关性的干扰信号模型,以保证对数据后处理雷达干扰的有效性。最后在与非相关干扰信号比较中,验证了该干扰方式的有效性。